Abstraction and computation - type theory, algebraic structures, and recursive functions
نویسنده
چکیده
ion and Computation Type Theory, Algebraic Structures, and Recursive Functions
منابع مشابه
On Decision Procedures for Algebraic Data Types with Abstractions
We describe a parameterized decision procedure that extends the decision procedure for functional recursive algebraic data types (trees) with the ability to specify and reason about abstractions of data structures. The abstract values are specified using recursive abstraction functions that map trees into other data types that have decidable theories. Our result yields a decidable logic which c...
متن کاملA Novel Reference Current Calculation Method for Shunt Active Power Filters using a Recursive Algebraic Approach
This paper presents a novel method to calculate the reference source current and the referencecompensating current for shunt active power filters (SAPFs). This method first calculates theamplitude and phase of the fundamental load current from a recursive algebraic approach blockbefore calculating the displacement power factor. Next, the amplitude of the reference mains currentis computed with ...
متن کاملDemo Proposal: Liquid Types for Haskell
We present LIQUIDHASKELL, a verifier for Haskell programs which uses Liquid Types to reduce the verification of higher-order, polymorphic, recursive programs over complex data types, into first-order Horn Clauses over integers, booleans and uninterpretated functions, which are then solved using classical predicate abstraction. In this demo proposal, we present an overview of this approach, and ...
متن کاملPARES – A Model for Parallel Recursive Programs
PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories we define a model of parallel computation with a very high level of abstraction – PARES (Parallel Recursive ...
متن کاملEffective cartesian closed categories of domains
Perhaps the most important and striking fact of domain theory is that important categories of domains are cartesian closed. This means that the category has a terminal object, finite products, and exponents. The only problematic part for domains is the exponent, which in this setting means the space of continuous functions. Cartesian closed categories of domains are well understood and the unde...
متن کامل